Decoding the (89, 45, 17) Quadratic Residue Code

نویسندگان

  • Pei-Yu Shih
  • Wen-Ku Su
  • Tsung-Ching Lin
  • Trieu-Kien Truong
چکیده

In this paper, a modification decoding algorithm for the (89, 45, 17) QR code is proposed to decode all error patterns with weight less than six and high percentage weight-6, weight-7, and weight-8 error patterns.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Viewpoint on the Decoding of the Quadratic Residue Code of Length 89

A viewpoint on the weight-6 error patterns of the algebraic decoding of the (89, 45, 17) quadratic residue (QR) code with reducible generator polynomial, proposed by Truong et al. (2008), is presented in this paper. Some weight-6 error patterns will cause a zero value in the syndrome S1. However, in this case, the inverse-free Berlekamp-Massey (IFBM) algorithm is still valid to determine the er...

متن کامل

Decoding the (41, 21, 9) Quadratic Residue Code

This paper proposes an algebraic decoding algorithm for the (41, 21, 9) quadratic residue code via Lagrange interpolation formula to determine error check and error locator polynomials. Programs written in C++ language have been executed to check every possible error pattern of this quadratic residue code.

متن کامل

Decoding of the ( 41 , 21 , 9 ) Quadratic Residue Code Using the Gao ’ s Algorithm

In this paper, a decoding method is proposed for the (41, 21, 9) quadratic residue code. The method is acquired through applying the condition of the modified Gao’s algorithm that is similar to fast transform decoding developed by Shiozaki [8]. The property of the syndrome polynomial is used in our decoding method. The new algorithm for has been verified by a software simulation using C languag...

متن کامل

On the Pless Construction and ML Decoding of the Quadratic Residue Code

We present a method for maximumlikelihood decoding of the quadratic residue code This method is based on projecting the code onto a subcode with an acyclic Tanner graph and representing the set of coset leaders by a trellis diagram This results in a two level coset decoding which can be considered a systematic generalization of the Wagner rule We show that unlike the Golay code the code does no...

متن کامل

New Algebraic Decoding of (17,9,5) Quadratic Residue Code by using Inverse Free Berlekamp-Massey Algorithm (IFBM)

In this paper a new algebraic decoding approach for (17,9,5) Quadratic Residue Code is proposed by using the Inverse Free Berlekamp-MasseyAlgorithm i.e. IFBM algorithm. By using an efficient algorithm an unknown syndrome are also developed in this paper. With the help of unknown syndromes, we achieve the alternative consecutive syndromes which are needed for the application of the Berlekamp-Mas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008